Detachable Electronic Coins
نویسندگان
چکیده
We propose a non-divisible electronic cash system that combines the restrictive blind signature technique and a batch signature scheme based upon the binary tree structure. Contemporary electronic cash solutions rely on the divisibility paradigm to achieve significant computational savings, and such techniques are considered to be the most efficient. We demonstrate an alternative approach that employs batch cryptography to withdraw and spend multiple coins. This approach provides a set of alternative primitives for an electronic cash system that possesses comparable efficiency to the most efficient divisible based schemes.
منابع مشابه
Properties of e cash pdf
Here we. There are scenarios however, where basic e-cash properties are not sufficient. Here we.Electronic cash. It can be traded for goods or.Electronic cash e-cash instruments allow digital payment for goods and ser. properties of e cash pdf There are scenarios however, where basic e-cash properties are not problemas de escritura pdf sufficient.Dec 27, 1997. Electronic coins possess similar p...
متن کاملImplementing regular cash with blind fixed-value electronic coins
We propose a generic framework for the development of an off-line peer-to-peer electronic payment system with fixed-value electronic coins. The proposed scheme simulates the issuance, circulation and characteristics of conventional cash and satisfies important security, privacy and usability requirements, offering a comparative advantage over other existing solutions. We exploit the strong secu...
متن کاملExact Analysis of Exact ChangePreliminary
We consider the k-payment problem: given a total budget of N units, represent this budget as a set of coins, so that any k exact payment requests of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any given N and k The actual payments are made on-line, namely without knowing all payment requests in advance. Our motivation ...
متن کاملExact Analysis of Exact Change
We consider the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any givenN and k, while allowing the actual payments to be made on-line, namely without the need to know all payment ...
متن کاملExact Analysis of Exact Change: The k-Payment Problem
Abstract. We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any given N and k, while allowing the actual payments to be made on-line, namely without the need to know ...
متن کامل